Modeling of Timed Petri Nets Using Deterministic (max, +) Automata
نویسندگان
چکیده
Automata with weights (multiplicities) in (max,+) algebra form a class of timed automata. Determinism is a crucial property for numerous results on (max,+) automata and, in particular, for applications to performance evaluation and control of a large class of timed discrete event systems. In this paper, we show how to build a deterministic (max,+) automaton equivalent to a live and safe timed Petri net in which any oriented path between any two transitions contains at most one ”conflict place”.
منابع مشابه
Using Interval Petri Nets and Timed Automata for Diagnosis of Discrete Event Systems (DES)
A discrete event system (DES) is a dynamic system that evolves in accordance with the abrupt occurrence, at possibly unknown irregular intervals, of physical events. Because of the special nature of these systems, different tools are currently used for their analysis, design and modeling. The main focus of this paper is the presentation of a new modeling approach of Discrete Event Systems. The ...
متن کاملCompositions of ( max , + ) automata Sébastien Lahaye
Abstract This paper presents a compositional modeling approach by means of (max,+) automata. The motivation is to be able to model a complex discrete event system by composing sub-models representing its elementary parts. A direct modeling of safe timed Petri nets using (max,+) automata is first introduced. Based on this result, two types of synchronous product of (max,+) automata are proposed ...
متن کاملCompositions of (max, +) automata
Abstract: Automata with weights (multiplicities) in the so called (max,+) semiring constitute a class of timed automata. Their modeling power has been studied in Gaubert and Mairesse (1999): at least timed safe Petri nets can be modeled by means of (max,+) automata. In this contribution, we define compositions for (max,+) automata. The motivation is to be able to model a complex system by compo...
متن کاملTimed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences
Timed Petri nets and timed automata are two standard models for the analysis of real-time systems. In this paper, we prove that they are incomparable for the timed language equivalence. Thus we propose an extension of timed Petri nets with read-arcs (RA-TdPN), whose coverability problem is decidable. We also show that this model unifies timed Petri nets and timed automata. Then, we establish nu...
متن کاملAnalyzing Non-Deterministic Real-Time Systems with (max, +) Algebra
We describe a hierarchical technique that allows a class of non-deterministic timed Petri nets to be analyzed using the (max,+) algebra of periodic signals. We show that the timing and controllability analysis of such systems is possible via the use of (supand) inf-convolution operations within the (max,+) framework. We apply this technique to the verification of timing constraints in an intell...
متن کامل